TSTP Solution File: SYN731^5 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN731^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 1 02:04:50 EDT 2023
% Result : Theorem 0.21s 0.53s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN731^5 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 20:18:38 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 %----Proving TH0
% 0.21/0.53 %------------------------------------------------------------------------------
% 0.21/0.53 % File : SYN731^5 : TPTP v8.1.2. Released v4.0.0.
% 0.21/0.53 % Domain : Syntactic
% 0.21/0.53 % Problem : TPS problem X2150
% 0.21/0.53 % Version : Especial.
% 0.21/0.53 % English :
% 0.21/0.53
% 0.21/0.53 % Refs : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.21/0.53 % Source : [Bro09]
% 0.21/0.53 % Names : tps_0095 [Bro09]
% 0.21/0.53 % : X2150 [TPS]
% 0.21/0.53
% 0.21/0.53 % Status : Theorem
% 0.21/0.53 % Rating : 0.09 v8.1.0, 0.08 v7.4.0, 0.11 v7.3.0, 0.10 v7.2.0, 0.12 v7.1.0, 0.14 v7.0.0, 0.12 v6.4.0, 0.14 v6.3.0, 0.17 v6.0.0, 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v4.0.0
% 0.21/0.53 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.21/0.53 % Number of atoms : 2 ( 0 equ; 0 cnn)
% 0.21/0.53 % Maximal formula atoms : 2 ( 2 avg)
% 0.21/0.53 % Number of connectives : 7 ( 0 ~; 0 |; 0 &; 6 @)
% 0.21/0.53 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.21/0.53 % Maximal formula depth : 8 ( 8 avg)
% 0.21/0.53 % Number of types : 2 ( 0 usr)
% 0.21/0.53 % Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% 0.21/0.53 % Number of symbols : 1 ( 1 usr; 0 con; 3-3 aty)
% 0.21/0.53 % Number of variables : 4 ( 0 ^; 1 !; 3 ?; 4 :)
% 0.21/0.53 % SPC : TH0_THM_NEQ_NAR
% 0.21/0.53
% 0.21/0.53 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.21/0.53 % project in the Department of Mathematical Sciences at Carnegie
% 0.21/0.53 % Mellon University. Distributed under the Creative Commons copyleft
% 0.21/0.53 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.21/0.53 % :
% 0.21/0.53 %------------------------------------------------------------------------------
% 0.21/0.53 thf(cP,type,
% 0.21/0.53 cP: $i > $i > $i > $o ).
% 0.21/0.53
% 0.21/0.53 thf(cX2150,conjecture,
% 0.21/0.53 ? [W: $i] :
% 0.21/0.53 ( ! [X: $i] :
% 0.21/0.53 ? [Y: $i] : ( cP @ W @ X @ Y )
% 0.21/0.53 => ? [Z: $i] : ( cP @ Z @ Z @ W ) ) ).
% 0.21/0.53
% 0.21/0.53 %------------------------------------------------------------------------------
% 0.21/0.53 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.PJ9mddfZvn/cvc5---1.0.5_2434.p...
% 0.21/0.53 (declare-sort $$unsorted 0)
% 0.21/0.53 (declare-fun tptp.cP ($$unsorted $$unsorted $$unsorted) Bool)
% 0.21/0.53 (assert (not (exists ((W $$unsorted)) (=> (forall ((X $$unsorted)) (exists ((Y $$unsorted)) (@ (@ (@ tptp.cP W) X) Y))) (exists ((Z $$unsorted)) (@ (@ (@ tptp.cP Z) Z) W))))))
% 0.21/0.53 (set-info :filename cvc5---1.0.5_2434)
% 0.21/0.53 (check-sat-assuming ( true ))
% 0.21/0.53 ------- get file name : TPTP file name is SYN731^5
% 0.21/0.53 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_2434.smt2...
% 0.21/0.53 --- Run --ho-elim --full-saturate-quant at 10...
% 0.21/0.53 % SZS status Theorem for SYN731^5
% 0.21/0.53 % SZS output start Proof for SYN731^5
% 0.21/0.53 (
% 0.21/0.53 (let ((_let_1 (not (exists ((W $$unsorted)) (=> (forall ((X $$unsorted)) (exists ((Y $$unsorted)) (@ (@ (@ tptp.cP W) X) Y))) (exists ((Z $$unsorted)) (@ (@ (@ tptp.cP Z) Z) W))))))) (let ((_let_2 (forall ((BOUND_VARIABLE_622 $$unsorted) (Z $$unsorted)) (not (ho_5 (ho_4 (ho_3 k_2 Z) Z) BOUND_VARIABLE_622))))) (let ((_let_3 (ho_5 (ho_4 (ho_3 k_2 e_$$unsorted_9) e_$$unsorted_9) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_24))) (let ((_let_4 (forall ((u |u_(-> $$unsorted Bool)|) (e Bool) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_5 v ii) (ite (= i ii) e (ho_5 u ii)))))))))) (let ((_let_5 (forall ((x |u_(-> $$unsorted Bool)|) (y |u_(-> $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_5 x z) (ho_5 y z)))) (= x y))))) (let ((_let_6 (forall ((u |u_(-> $$unsorted $$unsorted Bool)|) (e |u_(-> $$unsorted Bool)|) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_4 v ii) (ite (= i ii) e (ho_4 u ii)))))))))) (let ((_let_7 (forall ((x |u_(-> $$unsorted $$unsorted Bool)|) (y |u_(-> $$unsorted $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_4 x z) (ho_4 y z)))) (= x y))))) (let ((_let_8 (forall ((u |u_(-> $$unsorted $$unsorted $$unsorted Bool)|) (e |u_(-> $$unsorted $$unsorted Bool)|) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted $$unsorted $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_3 v ii) (ite (= i ii) e (ho_3 u ii)))))))))) (let ((_let_9 (forall ((x |u_(-> $$unsorted $$unsorted $$unsorted Bool)|) (y |u_(-> $$unsorted $$unsorted $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_3 x z) (ho_3 y z)))) (= x y))))) (let ((_let_10 (forall ((BOUND_VARIABLE_611 $$unsorted) (X $$unsorted)) (not (forall ((Y $$unsorted)) (not (ho_5 (ho_4 (ho_3 k_2 BOUND_VARIABLE_611) X) Y))))))) (let ((_let_11 (MACRO_SR_PRED_TRANSFORM (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (and (forall ((BOUND_VARIABLE_611 $$unsorted) (X $$unsorted)) (not (forall ((Y $$unsorted)) (not (@ (@ (@ tptp.cP BOUND_VARIABLE_611) X) Y))))) (forall ((BOUND_VARIABLE_622 $$unsorted) (Z $$unsorted)) (not (@ (@ (@ tptp.cP Z) Z) BOUND_VARIABLE_622)))) (and _let_10 _let_2)))))) (PREPROCESS :args ((and _let_9 _let_8 _let_7 _let_6 _let_5 _let_4)))) :args ((and _let_10 _let_2 _let_9 _let_8 _let_7 _let_6 _let_5 _let_4))))) (let ((_let_12 (forall ((Y $$unsorted)) (not (ho_5 (ho_4 (ho_3 k_2 e_$$unsorted_9) e_$$unsorted_9) Y))))) (let ((_let_13 (not _let_12))) (let ((_let_14 (_let_10))) (let ((_let_15 (_let_13))) (let ((_let_16 (_let_2))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_16) :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_24 e_$$unsorted_9 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_16)) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (SKOLEMIZE (ASSUME :args _let_15)) :args _let_15) (REWRITE :args ((=> _let_13 (not (not _let_3))))))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_13) _let_12))) (REFL :args (_let_3)) :args (or))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_14) :args (e_$$unsorted_9 e_$$unsorted_9 QUANTIFIERS_INST_ENUM)) :args _let_14)) (AND_ELIM _let_11 :args (0)) :args (_let_13 false _let_10)) :args (_let_3 true _let_12)) (AND_ELIM _let_11 :args (1)) :args (false false _let_3 false _let_2)) :args (_let_1 true)))))))))))))))))))
% 0.21/0.54 )
% 0.21/0.54 % SZS output end Proof for SYN731^5
% 0.21/0.54 % cvc5---1.0.5 exiting
% 0.21/0.54 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------